Stability and incentives for college admissions with budget constraints

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

College Admissions and the Stability of Marriage

Your use of the JSTOR archive indicates your acceptance of JSTOR's Terms and Conditions of Use, available at http://www.jstor.org/page/info/about/policies/terms.jsp. JSTOR's Terms and Conditions of Use provides, in part, that unless you have obtained prior permission, you may not download an entire issue of a journal or multiple copies of articles, and you may use content in the JSTOR archive o...

متن کامل

for “ Decentralized College Admissions ”

where the the last inequality holds since mA(s) < mA(1) for s < 1. Note that A benefits from the deviation since it admits more students without exceeding its capacity. Similarly, if mA(0) > κ, then A can benefit by rejecting mA(0) − κ of students. Thus, we must have mA(0) ≤ κ ≤ mA(1) in equilibrium. Step 2. In equilibrium, there is a unique ŝi ∈ (0, 1), for i = A,B, such that mi(ŝi) = κ. Proof...

متن کامل

College admissions with affirmative action

This paper first shows that when colleges’ preferences are substitutable there does not exist any stable matching mechanism that makes truthful revelation of preferences a dominant strategy for every student. The paper introduces student types and captures colleges’ preferences for affirmative action via type-specific quotas: A college always prefers a set of students that respects its type-spe...

متن کامل

Auctions with Budget Constraints

In a combinatorial auction k different items are sold to n bidders, where the objective of the seller is to maximize the revenue. The main difficulty to find an optimal allocation is due to the fact that the valuation function of each bidder for bundles of items is not necessarily an additive function over the items. An auction with budget constraints is a common special case where bidders gene...

متن کامل

Mechanisms for Combinatorial Auctions with Budget Constraints

This paper studies combinatorial auctions with budget-constrained bidders from a mechanism design perspective. I search for mechanisms that are incentive compatible, individually rational, symmetric, nonwasteful and non-bossy. First focusing on the greedy domain, in which any increase in a bidder’s valuation always exceeds his budget, I derive the unique mechanism, called the Iterative Second P...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Theoretical Economics

سال: 2016

ISSN: 1933-6837

DOI: 10.3982/te1731